Creating High-quality Paths for Motion Planning

نویسندگان

  • Roland Geraerts
  • Mark H. Overmars
چکیده

Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, the path must be of a good quality as well. That is, a path should be short and should keep some amount of minimum clearance to the obstacles. Traveling along such a path reduces the chances of collisions due to the difficulty of measuring and controlling the precise position of the robot. This paper reports a new technique, called Partial shortcut, which decreases the path length. While current methods have difficulties in removing all redundant motions, the technique efficiently removes these motions by interpolating one degree of freedom at a time. Two algorithms are also studied that increase the clearance along paths. The first one is fast but can only deal with rigid, translating bodies. The second algorithm is slower but can handle a broader range of robots, including three-dimensional free-flying and articulated robots, which may reside in arbitrary high-dimensional configuration spaces. A big advantage of these algorithms is that clearance along paths can now be increased efficiently without using complex data structures and algorithms. Finally, we combine the two criteria and show that highquality paths can be obtained for a broad range of robots. KEY WORDS—motion planning, path quality, path length, path clearance

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the Quality of Non-Holonomic Motion by Hybridizing C-PRM Paths

Sampling-based motion planners are an effective means for generating collision-free motion paths. However, the quality of these motion paths, with respect to different quality measures such as path length, clearance, smoothness or energy, is often notoriously low. This problem is accentuated in the case of non-holonomic sampling-based motion planning, in which the space of feasible motion traje...

متن کامل

Automatic Construction of Roadmaps for Path Planning in Games

Path planning plays an important role in many computer games. Currently the motion of entities is often planned using a combination of scripting, grid-search methods, and reactive approaches. In this paper we describe a new approach, based on a technique from robotics, that computes a roadmap of smooth, collision-free, high-quality paths. This roadmap can be used to obtain instantly good paths ...

متن کامل

Creating High-Quality Roadmaps for Path Planning

A central problem in robotics is planning a collision-free path for a robot in a static environment with obstacles. Such a path is usually extracted from a roadmap that represents the connectedness of the free space. Contemporary algorithms generally do not give guarantees on the quality of the roadmap, and, hence, the quality of the paths. While techniques exist for optimizing the paths in the...

متن کامل

Planning High-quality Paths and Corridors Amidst Obstacles

The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design. In this paper we study the problem of planning high-quality paths. A high-quality path should have some desirable properties: it should be short and avoid long detours, and at the same time it should stay at a safe di...

متن کامل

A Little More, a Lot Better: Improving Path Quality by a Simple Path Merging Algorithm

Sampling-based motion planners are an effective means for generating collision-free motion paths. However, the quality of these motion paths (with respect to quality measures such as path length, clearance, smoothness or energy) is often notoriously low, especially in high-dimensional configuration spaces. We introduce a simple algorithm for merging an arbitrary number of input motion paths int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • I. J. Robotics Res.

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2007